probFD

python2.7 ../probfd-qcomp19/builds/release64/bin/translate/translate.py domain.pddl p20.pddl
../probfd-qcomp19/builds/release64/bin/downward --sas output.sas --engine fretpi-hdp --heuristic hmax --enable-caching --epsilon 1e-6

Parsing...
Warning: Atom spare-in(l-41-1) is specified twice in initial state specification
Parsing: [0.010s CPU, 0.012s wall-clock]
Normalizing task... [0.000s CPU, 0.000s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.014s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.000s CPU, 0.001s wall-clock]
Preparing model... [0.030s CPU, 0.033s wall-clock]
Generated 16 rules.
Computing model... [0.110s CPU, 0.112s wall-clock]
11866 relevant atoms
9303 auxiliary atoms
21169 final queue length
24128 total queue pushes
Completing instantiation... [0.110s CPU, 0.110s wall-clock]
Instantiating: [0.270s CPU, 0.276s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.000s CPU, 0.001s wall-clock]
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
Instantiating groups... [0.010s CPU, 0.003s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.001s wall-clock]
Choosing groups...
461 uncovered facts
Choosing groups: [0.000s CPU, 0.002s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.030s CPU, 0.029s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.006s wall-clock]
Translating task: [0.100s CPU, 0.103s wall-clock]
2140 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
1 propositions removed
Detecting unreachable propositions: [0.050s CPU, 0.044s wall-clock]
Reordering and filtering variables...
462 of 462 variables necessary.
0 of 1 mutex groups necessary.
3820 of 3820 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.014s wall-clock]
Translator variables: 462
Translator derived variables: 0
Translator facts: 1783
Translator goal facts: 1
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 3820
Translator axioms: 0
Translator task size: 19665
Translator peak memory: 43508 KB
Writing output... [0.020s CPU, 0.019s wall-clock]
Done! [0.500s CPU, 0.508s wall-clock]	

Warning: :types specification not allowed here (cf. PDDL BNF)	

reading input... [t=0.000206288s]
done reading input! [t=0.00560076s]
variables: 462
goals: 1
actions: 3820
axioms: 0
has conditional effects: 0
reconstructing probabilistic actions... [t=0.00561652s]
done reconstructing probabilistic actions! [t=0.0128804s]
probabilistic actions: 2140 (with 3820 outcomes)
constructing successor generator... [t=0.0132247s]
done constructing successor generator! [t=0.0136152s]
Bytes per state: 60
Property: MaxProb
Preparing hmax dead end detection heuristic... [t=0.0136995s]
hmax initialization done! [t=0.0144788s]
Engine: FRET-pi with HDP
Starting trap elimination heuristic search wrapper...
Initial state reward: 1
Expansions: 486
Registered states: 1186
Generated states: 1322
Cached transitions: 855
Expansion cache hits: 3810
Transition cache hits: 9114
Approximate transition cache memory usage: 57KB
Solver time: 0.008619243000000002125s
Total time: 0.02317843199999999881s